Cubically convergent method for locating a nearby vertex in linear programming

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cubically Convergent Iterations for Invariant

We propose a Newton-like iteration that evolves on the set of fixed dimensional subspaces of Rn and converges locally cubically to the invariant subspaces of a symmetric matrix. This iteration is compared in terms of numerical cost and global behavior with three other methods that display the same property of cubic convergence. Moreover, we consider heuristics that greatly improve the global be...

متن کامل

On Constructing a Cubically Convergent Numerical Method for Multiple Roots

We propose the numerical method defined by xn+1 = xn − λ f(xn − μh(xn)) f ′(xn) , n ∈ N, and determine the control parameter λ and μ to converge cubically. In addition, we derive the asymptotic error constant. Applying this proposed scheme to various test functions, numerical results show a good agreement with the theory analyzed in this paper and are proven using Mathematica with its high-prec...

متن کامل

On a Cubically Convergent Iterative Method for Matrix Sign

We propose an iterative method for finding matrix sign function. It is shown that the scheme has global behavior with cubical rate of convergence. Examples are included to show the applicability and efficiency of the proposed scheme and its reciprocal.

متن کامل

An Efficient Cubically Convergent Two-Point Newton Method

A numerical procedure fo r solving non-linear equations is presented which is a modification of the Two Point Newton Method developed by the author earlier. It is shown that the method presented here has a third order convergence. The modified procedure incorporates computation of the x value for an intermediate point using the original Two Point Newton Method. The derivative of the intermediat...

متن کامل

Cubically Convergent Iterations for Invariant Subspace Computation

We propose a Newton-like iteration that evolves on the set of fixed dimensional subspaces of Rn and converges locally cubically to the invariant subspaces of a symmetric matrix. This iteration is compared in terms of numerical cost and global behavior with three other methods that display the same property of cubic convergence. Moreover, we consider heuristics that greatly improve the global be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Optimization Theory and Applications

سال: 1990

ISSN: 0022-3239,1573-2878

DOI: 10.1007/bf00940473